Many-one reduction

#	Item
21	The Complexity of Unions of Disjoint Sets Christian Glaßer∗, Alan L. Selman†, Stephen Travers‡, and Klaus W. Wagner∗ Abstract This paper is motivated by the open question whether the union of two disjoint NPcomp Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2006-11-08 15:58:52 Complexity classes Computability theory NP-complete problems Structural complexity theory Polynomial hierarchy NP PP Many-one reduction Oracle machine Theoretical computer science Computational complexity theory Applied mathematics
22	Disjoint NP-Pairs Christian Glaßer 1 Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2003-02-17 11:57:27 Complexity classes P versus NP problem NP-complete NP Oracle machine PP P Many-one reduction Time complexity Theoretical computer science Computational complexity theory Applied mathematics